A comparison of two heuristic approaches for distribution feeder

In this paper, a comprehensive comparison of two distinct heuristic search approaches to solve the distribution switchin9 problem is presented. One approach is' based on a priority list of switches of the main search path defined by the feeder tie switch upstream to the substation. The other approach uses evaluation functions to address the problem. Evaluation functions are defined based on feeder layout, load level, and abnormal condition of the system to 9uide the searchin9 process. A practical distribution system is used to test these two approaches. Items discussed include computing time, number of switchin9 operations, and indices for feeder load balancing, transformer load balancing, and three-phase current balancing of their solutions. Results indicate that the priority list approach exhibits very high efficiency and solutions are fairly reliable. The evaluation function approach is more likely to find a solution with a minimum number of switchin9 operations. Furthermore, the evaluation function approach is more robust in the case of serious contingencies.